Index appearance record with preorders
نویسندگان
چکیده
Abstract Transforming $$\omega $$ ? -automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable all compare the methods experimentally show that our method produces significantly smaller than previous approaches.
منابع مشابه
Index Appearance Record for Transforming Rabin Automata into Parity Automata
Transforming deterministic ω-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches....
متن کاملRandom preorders and alignments
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a random preorder chosen uniformly at random among all preorders on n elements, and also the distribution of cycles in a random alignment chosen uniformly at random among all alignments on n elements, as n →∞.
متن کاملRandom preorders
A random preorder on n elements consists of linearly ordered equivalence classes called blocks. We investigate the block structure of a preorder chosen uniformly at random from all preorders on n elements as n→ ∞.
متن کاملMultiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...
متن کاملQuick Record Lookup without an Index
INTRODUCTION As with most database software the SAS System allows data sets to be indexed on key variables. An index is a secondary file that stores the unique values of the key and their positions on the data set. Once a data set is indexed SAS will directly lookup a record when a WHERE clause is used. Up to a certain percentage of records, the index will retrieve data much more quickly than a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2021
ISSN: ['1432-0525', '0001-5903']
DOI: https://doi.org/10.1007/s00236-021-00412-y